Большие уклонения гауссовских мер в пространствах $l^p$ и $L^p$, $p\ge2$

LP problems constrained with D-FRIs

In this paper, optimization of a linear objective function with fuzzy relational inequality constraints is investigated where the feasible region is formed as the intersection of two inequality fuzzy systems and Dombi family of t-norms is considered as fuzzy composition. Dombi family of t-norms includes a parametric family of continuous strict t-norms, whose members are increasing functions of ...

Totally probabilistic Lp spaces

In this paper, we introduce the notion of probabilistic valued measures as a generalization of non-negative measures and construct the corresponding Lp spaces, for distributions p > "0. It is alsoshown that if the distribution p satises p "1 then, as in the classical case, these spaces are completeprobabilistic normed spaces.

Quantified LP

An extension, QLP, of the propositional logic of explicit proofs, LP, is created, allowing quantification over proofs. The resulting logic is given an axiomatization, a Kripke-style semantics, and soundness and completeness are shown. It is shown that S4 embeds into the logic, when we translate the necessity operator using a quantifier: there exists an explicit proof. And it is shown that the p...

Requip Lp

LP Decoding

Linear programming (LP) relaxation is a common technique used to find good solutions to complex optimization problems. We present the method of “LP decoding”: applying LP relaxation to the problem of maximum-likelihood (ML) decoding. An arbitrary binary-input memoryless channel is considered. This treatment of the LP decoding method places our previous work on turbo codes [6] and low-density pa...